Computation of Galois groups over function fields
نویسندگان
چکیده
منابع مشابه
Computation of Galois groups over function fields
Symmetric function theory provides a basis for computing Galois groups which is largely independent of the coefficient ring. An exact algorithm has been implemented over Q(t1, t2, . . . , tm) in Maple for degree up to 8. A table of polynomials realizing each transitive permutation group of degree 8 as a Galois group over the rationals is included.
متن کاملGalois Groups over Nonrigid Fields
Let F be a field with charF 6= 2. We show that there are two groups of order 32, respectively 64, such that a field F with char F 6= 2 is nonrigid if and only if at least one of the two groups is realizable as a Galois group over F . The realizability of those groups turns out to be equivalent to the realizability of certain quotients (of order 16, respectively 32). Using known results on conne...
متن کاملGalois Groups over Function Fields of Positive Characteristic
We describe examples motivated by the work of Serre and Abhyankar. Subject Class: Primary 11F22, 11F03. Secondary 30F35, 20C34.
متن کاملOn Galois Groups of Abelian Extensions over Maximal Cyclotomic Fields
Let k0 be a finite algebraic number field in a fixed algebraic closure Ω and ζn denote a primitive n-th root of unity ( n ≥ 1). Let k∞ be the maximal cyclotomic extension of k0, i.e. the field obtained by adjoining to k0 all ζn ( n = 1, 2, ...). Let M and L be the maximal abelian extension of k∞ and the maximal unramified abelian extension of k∞ respectively. The Galois groups Gal(M/k∞) and Gal...
متن کاملCommuting Elements in Galois Groups of Function Fields
— We study the structure of abelian subgroups of Galois groups of function fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1997
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-97-00831-4